On the complexity of tree embedding problems = Sur la complexité de problèmes d'arbre incrustéSIMONSON, S; HAL SUDBOROUGH, I.Information processing letters. 1992, Vol 44, Num 6, pp 323-328, issn 0020-0190Article

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Identifying periodic occurrences of a template with applications to protein structureFISCHETTI, V. A; LAUDAU, G. M; SELLERS, P. H et al.Information processing letters. 1993, Vol 45, Num 1, pp 11-18, issn 0020-0190Article

Modeling hypergraphs by graphs with the same mincut propertiesIHLER, E; WAGNER, D; WAGNER, F et al.Information processing letters. 1993, Vol 45, Num 4, pp 171-175, issn 0020-0190Article

Optimal slope selection via expandersKATZ, M. J; SHARIR, M.Information processing letters. 1993, Vol 47, Num 3, pp 115-122, issn 0020-0190Article

Engineering a sort functionBENTLEY, J. L; MCILROY, M. D.Software, practice & experience. 1993, Vol 23, Num 11, pp 1249-1265, issn 0038-0644Article

A distributed voting scheme to maximize preferencesAUER, Peter; CESA-BIANCHI, Nicolo.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 389-403, issn 0988-3754, 15 p.Article

On tuning the Boyer-Moore-Horspool string searching algorithmSMITH, P. D.Software, practice & experience. 1994, Vol 24, Num 4, pp 435-436, issn 0038-0644Article

A faster alternative to SSS^* with extension to variable memorySUBIR BHATTACHARYA; BAGCHI, A.Information processing letters. 1993, Vol 47, Num 4, pp 209-214, issn 0020-0190Article

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphsMING-SHING YU; LIN YU TSENG; SHOE-JANE CHANG et al.Information processing letters. 1993, Vol 46, Num 1, pp 7-11, issn 0020-0190Article

Systolic partitioning algorithmsMEGSON, G. M.Information processing letters. 1993, Vol 46, Num 1, pp 13-18, issn 0020-0190Article

The all-pairs quickest path problemLEE, D. T; PAPADOPOULOU, E.Information processing letters. 1993, Vol 45, Num 5, pp 261-267, issn 0020-0190Article

Approximate parametric searchingTOLEDO, S.Information processing letters. 1993, Vol 47, Num 1, pp 1-4, issn 0020-0190Article

A modified greedy heuristic for the Set Covering problem with improved worst case boundGOLDSCHMIDT, O; HOCHBAUM, D. S; GANG YU et al.Information processing letters. 1993, Vol 48, Num 6, pp 305-310, issn 0020-0190Article

The recognition of union treesLEIZHEN CAI.Information processing letters. 1993, Vol 45, Num 6, pp 279-283, issn 0020-0190Article

The smallest upravelBIRD, R. S.Science of computer programming. 1992, Vol 18, Num 3, pp 281-292, issn 0167-6423Article

A probabilistic algorithm for verifying matrix products using O(n²) time and log₂n+O(1) random bitsKIMBREL, T; SINHA, K. R.Information processing letters. 1993, Vol 45, Num 2, pp 107-110, issn 0020-0190Article

Scramjet missile design using genetic algorithmsHARTFIELD, R. J; BURKHALTER, J. E; JENKINS, R. M et al.Applied mathematics and computation. 2006, Vol 174, Num 2, pp 1539-1563, issn 0096-3003, 25 p.Article

LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMSBODIRSKY, Manuel; KRAL, Daniel.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 916-933, issn 0895-4801, 18 p.Article

The longest almost-increasing subsequenceELMASRY, Amr.Information processing letters. 2010, Vol 110, Num 16, pp 655-658, issn 0020-0190, 4 p.Article

The rectilinear steiner arborescence problem is NP-completeWEIPING SHI; CHEN SU.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 729-740, issn 0097-5397, 12 p.Article

An incremental LL(1) parsing algorithmWUU YANG.Information processing letters. 1993, Vol 48, Num 2, pp 67-72, issn 0020-0190Article

Determining uni-connectivity in directed graphsBUCHSBAUM, A. L; CARLISLE, M. C.Information processing letters. 1993, Vol 48, Num 1, pp 9-12, issn 0020-0190Article

Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different speciesHSIEH, Sun-Yuan.Theoretical computer science. 2007, Vol 370, Num 1-3, pp 299-308, issn 0304-3975, 10 p.Article

On survivable network polyhedraKERIVIN, Hervé; ALI RIDHA MAHJOUB.Discrete mathematics. 2005, Vol 290, Num 2-3, pp 183-210, issn 0012-365X, 28 p.Article